Model Checking Omega Cellular Automata
نویسنده
چکیده
The evolution of one-way infinite cellular automata can be described by the firstorder theory of phase-space, which uses one-step evolution as its main predicate. Formulas in this logic can be used to express properties of the global map such as surjectivity. A complete implementation of the decision algorithm is provided, as well as methods for manipulating the Büchi automata on which the decision algorithm relies. Experimental results and a discussion of the tractability of larger problems are presented. Chapter
منابع مشابه
Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties
Probabilistic timed automata (PTAs) are timed automata (TAs) extended with discrete probability distributions. They serve as a mathematical model for a wide range of applications that involve both stochastic and timed behaviours. In this work, we consider the problem of model-checking linear dense-time properties over PTAs. In particular, we study linear dense-time properties that can be encode...
متن کاملNominal deterministic omega automata
Nominal sets, presheaf categories, and named sets have successfully served as models of the state space of process calculi featuring resource generation. More recently, automata built in such categories have been studied as acceptors of languages of finite words over infinite alphabets. In this paper we investigate automata whose state spaces are nominal sets, and that accept infinite words. Th...
متن کاملOmega-Regular Model Checking
“Regular model checking” is the name of a family of techniques for analyzing infinite-state systems in which states are represented by words or trees, sets of states by finite automata on these objects, and transitions by finite automata operating on pairs of state encodings, i.e. finite-state transducers. In this context, the central problem is then to compute the iterative closure of a finite...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملPattern Formation of the FitzHugh-Nagumo Model: Cellular Automata Approach
FitzHugh-Nagumo (FHN) model is a famous Reaction-Diffusion System which first introduced for the conduction of electrical impulses along a nerve fiber. This model is also considered as an abstract model for pattern formation. Here, we have used the Cellular Automata method to simulate the pattern formation of the FHN model. It is shown that the pattern of this model is very similar to those...
متن کامل